翻訳と辞書 Words near each other ・ Multipoint control unit ・ Multiple Sarcasms ・ Multiple Satellite Imaging ・ Multiple sclerosis ・ Multiple Sclerosis Discovery Forum ・ Multiple Sclerosis Foundation ・ Multiple sclerosis functional composite ・ Multiple Sclerosis International Federation ・ Multiple Sclerosis Journal ・ Multiple sclerosis research ・ Multiple sclerosis signs and symptoms ・ Multiple Sclerosis Society ・ Multiple Sclerosis Society of Canada ・ Multiple Sclerosis Society of Great Britain ・ Multiple Sclerosis Trust ・ Multiple sequence alignment ・ Multiple sexual ornaments ・ Multiple Sidosis ・ Multiple signal classification ・ Multiple single-level ・ Multiple Sleep Latency Test ・ Multiple Species Conservation Program ・ Multiple sub-Nyquist sampling encoding ・ Multiple subpial transection ・ Multiple Subscriber Number ・ Multiple sulfatase deficiency ・ Multiple system atrophy ・ Multiple Threat Alert Center ・ Multiple time dimensions ・ Multiple trace theory Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Multiple sequence alignment ： ウィキペディア英語版 Multiple sequence alignment A multiple sequence alignment (MSA) is a sequence alignment of three or more biological sequences, generally protein, DNA, or RNA. In many cases, the input set of query sequences are assumed to have an evolutionary relationship by which they share a lineage and are descended from a common ancestor. From the resulting MSA, sequence homology can be inferred and phylogenetic analysis can be conducted to assess the sequences' shared evolutionary origins. Visual depictions of the alignment as in the image at right illustrate mutation events such as point mutations (single amino acid or nucleotide changes) that appear as differing characters in a single alignment column, and insertion or deletion mutations (indels or gaps) that appear as hyphens in one or more of the sequences in the alignment. Multiple sequence alignment is often used to assess sequence conservation of protein domains, tertiary and secondary structures, and even individual amino acids or nucleotides. Multiple sequence alignment also refers to the process of aligning such a sequence set. Because three or more sequences of biologically relevant length can be difficult and are almost always time-consuming to align by hand, computational algorithms are used to produce and analyze the alignments. MSAs require more sophisticated methodologies than pairwise alignment because they are more computationally complex. Most multiple sequence alignment programs use heuristic methods rather than global optimization because identifying the optimal alignment between more than a few sequences of moderate length is prohibitively computationally expensive. ==Dynamic programming and computational complexity== A direct method for producing an MSA uses the dynamic programming technique to identify the globally optimal alignment solution. For proteins, this method usually involves two sets of parameters: a gap penalty and a substitution matrix assigning scores or probabilities to the alignment of each possible pair of amino acids based on the similarity of the amino acids' chemical properties and the evolutionary probability of the mutation. For nucleotide sequences a similar gap penalty is used, but a much simpler substitution matrix, wherein only identical matches and mismatches are considered, is typical. The scores in the substitution matrix may be either all positive or a mix of positive and negative in the case of a global alignment, but must be both positive and negative, in the case of a local alignment.〔(【引用サイトリンク】 publisher=European Bioinformatics Institute )〕 For ''n'' individual sequences, the naive method requires constructing the ''n''-dimensional equivalent of the matrix formed in standard pairwise sequence alignment. The search space thus increases exponentially with increasing ''n'' and is also strongly dependent on sequence length. Expressed with the big O notation commonly used to measure computational complexity, a naïve MSA takes ''O(LengthNseqs)'' time to produce. To find the global optimum for ''n'' sequences this way has been shown to be an NP-complete problem. In 1989, based on Carrillo-Lipman Algorithm,〔Carrillo H, Lipman DJ,(1988) The Multiple Sequence Alignment Problem in Biology. SIAM Journal of Applied Mathematics, Vol.48, No. 5, 1073-1082〕 Altschul introduced a practical method that uses pairwise alignments to constrain the n-dimensional search space. In this approach pairwise dynamic programming alignments are performed on each pair of sequences in the query set, and only the space near the n-dimensional intersection of these alignments is searched for the n-way alignment. The MSA program optimizes the sum of all of the pairs of characters at each position in the alignment (the so-called ''sum of pair'' score) and has been implemented in a software program for constructing multiple sequence alignments.〔(【引用サイトリンク】 publisher=National Center for Biotechnology Information )〕 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Multiple sequence alignment」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.